#include<bits/stdc++.h>
using namespace std;
int a[1000010];
int n,cnt,s;
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    sort(a+1,a+n+1);
    for(int i=n;i>=1;i--)
    {
        if(a[i]>a[i-1])
        {
            cnt++;
            i--;
        }
    }
    s=n-cnt;
    printf("%d",s);
    return 0;
}

